TSTP Solution File: DAT056^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : DAT056^1 : TPTP v8.1.2. Released v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n012.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun May 5 05:04:25 EDT 2024
% Result : Theorem 0.11s 0.36s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 29
% Syntax : Number of formulae : 67 ( 17 unt; 17 typ; 0 def)
% Number of atoms : 103 ( 69 equ; 0 cnn)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 694 ( 45 ~; 33 |; 6 &; 596 @)
% ( 4 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% Number of symbols : 19 ( 17 usr; 15 con; 0-2 aty)
% Number of variables : 120 ( 0 ^ 85 !; 34 ?; 120 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
lst: $tType ).
thf(type_def_7,type,
a: $tType ).
thf(func_def_0,type,
lst: $tType ).
thf(func_def_1,type,
a: $tType ).
thf(func_def_2,type,
ap: lst > lst > lst ).
thf(func_def_3,type,
cns: a > lst > lst ).
thf(func_def_4,type,
nl: lst ).
thf(func_def_5,type,
xs: lst ).
thf(func_def_7,type,
vEPSILON:
!>[X0: $tType] : ( ( X0 > $o ) > X0 ) ).
thf(func_def_10,type,
sK0: lst ).
thf(func_def_11,type,
sK1: a ).
thf(func_def_12,type,
sK2: lst ).
thf(func_def_13,type,
sK3: lst ).
thf(func_def_14,type,
sK4: lst ).
thf(func_def_15,type,
sK5: lst ).
thf(func_def_16,type,
sK6: lst ).
thf(func_def_17,type,
sK7: lst ).
thf(f64,plain,
$false,
inference(avatar_sat_refutation,[],[f38,f43,f47,f54,f63]) ).
thf(f63,plain,
( ~ spl8_2
| spl8_4 ),
inference(avatar_contradiction_clause,[],[f62]) ).
thf(f62,plain,
( $false
| ~ spl8_2
| spl8_4 ),
inference(trivial_inequality_removal,[],[f61]) ).
thf(f61,plain,
( ( ( cns @ sK1 @ ( ap @ sK0 @ ( ap @ sK3 @ sK2 ) ) )
!= ( cns @ sK1 @ ( ap @ sK0 @ ( ap @ sK3 @ sK2 ) ) ) )
| ~ spl8_2
| spl8_4 ),
inference(forward_demodulation,[],[f60,f33]) ).
thf(f33,plain,
( ! [X6: lst,X5: lst] :
( ( ap @ sK0 @ ( ap @ X5 @ X6 ) )
= ( ap @ ( ap @ sK0 @ X5 ) @ X6 ) )
| ~ spl8_2 ),
inference(avatar_component_clause,[],[f32]) ).
thf(f32,plain,
( spl8_2
<=> ! [X6: lst,X5: lst] :
( ( ap @ sK0 @ ( ap @ X5 @ X6 ) )
= ( ap @ ( ap @ sK0 @ X5 ) @ X6 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_2])]) ).
thf(f60,plain,
( ( ( cns @ sK1 @ ( ap @ ( ap @ sK0 @ sK3 ) @ sK2 ) )
!= ( cns @ sK1 @ ( ap @ sK0 @ ( ap @ sK3 @ sK2 ) ) ) )
| spl8_4 ),
inference(forward_demodulation,[],[f59,f27]) ).
thf(f27,plain,
! [X2: lst,X0: a,X1: lst] :
( ( cns @ X0 @ ( ap @ X1 @ X2 ) )
= ( ap @ ( cns @ X0 @ X1 ) @ X2 ) ),
inference(cnf_transformation,[],[f22]) ).
thf(f22,plain,
! [X0: a,X1: lst,X2: lst] :
( ( cns @ X0 @ ( ap @ X1 @ X2 ) )
= ( ap @ ( cns @ X0 @ X1 ) @ X2 ) ),
inference(rectify,[],[f9]) ).
thf(f9,plain,
! [X1: a,X0: lst,X2: lst] :
( ( cns @ X1 @ ( ap @ X0 @ X2 ) )
= ( ap @ ( cns @ X1 @ X0 ) @ X2 ) ),
inference(rectify,[],[f2]) ).
thf(f2,axiom,
! [X8: lst,X9: a,X7: lst] :
( ( ap @ ( cns @ X9 @ X8 ) @ X7 )
= ( cns @ X9 @ ( ap @ X8 @ X7 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.ZcYYrGgQyB/Vampire---4.8_12256',fact_1p_Osimps_I2_J) ).
thf(f59,plain,
( ( ( ap @ ( cns @ sK1 @ sK0 ) @ ( ap @ sK3 @ sK2 ) )
!= ( cns @ sK1 @ ( ap @ ( ap @ sK0 @ sK3 ) @ sK2 ) ) )
| spl8_4 ),
inference(forward_demodulation,[],[f58,f27]) ).
thf(f58,plain,
( ( ( ap @ ( cns @ sK1 @ sK0 ) @ ( ap @ sK3 @ sK2 ) )
!= ( ap @ ( cns @ sK1 @ ( ap @ sK0 @ sK3 ) ) @ sK2 ) )
| spl8_4 ),
inference(forward_demodulation,[],[f42,f27]) ).
thf(f42,plain,
( ( ( ap @ ( cns @ sK1 @ sK0 ) @ ( ap @ sK3 @ sK2 ) )
!= ( ap @ ( ap @ ( cns @ sK1 @ sK0 ) @ sK3 ) @ sK2 ) )
| spl8_4 ),
inference(avatar_component_clause,[],[f40]) ).
thf(f40,plain,
( spl8_4
<=> ( ( ap @ ( cns @ sK1 @ sK0 ) @ ( ap @ sK3 @ sK2 ) )
= ( ap @ ( ap @ ( cns @ sK1 @ sK0 ) @ sK3 ) @ sK2 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_4])]) ).
thf(f54,plain,
~ spl8_1,
inference(avatar_contradiction_clause,[],[f53]) ).
thf(f53,plain,
( $false
| ~ spl8_1 ),
inference(trivial_inequality_removal,[],[f52]) ).
thf(f52,plain,
( ( ( ap @ xs @ ( ap @ sK7 @ sK6 ) )
!= ( ap @ xs @ ( ap @ sK7 @ sK6 ) ) )
| ~ spl8_1 ),
inference(superposition,[],[f26,f30]) ).
thf(f30,plain,
( ! [X10: lst,X0: lst,X9: lst] :
( ( ap @ X0 @ ( ap @ X10 @ X9 ) )
= ( ap @ ( ap @ X0 @ X10 ) @ X9 ) )
| ~ spl8_1 ),
inference(avatar_component_clause,[],[f29]) ).
thf(f29,plain,
( spl8_1
<=> ! [X9: lst,X0: lst,X10: lst] :
( ( ap @ X0 @ ( ap @ X10 @ X9 ) )
= ( ap @ ( ap @ X0 @ X10 ) @ X9 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_1])]) ).
thf(f26,plain,
( ( ap @ ( ap @ xs @ sK7 ) @ sK6 )
!= ( ap @ xs @ ( ap @ sK7 @ sK6 ) ) ),
inference(cnf_transformation,[],[f21]) ).
thf(f21,plain,
( ( ap @ ( ap @ xs @ sK7 ) @ sK6 )
!= ( ap @ xs @ ( ap @ sK7 @ sK6 ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7])],[f19,f20]) ).
thf(f20,plain,
( ? [X0: lst,X1: lst] :
( ( ap @ ( ap @ xs @ X1 ) @ X0 )
!= ( ap @ xs @ ( ap @ X1 @ X0 ) ) )
=> ( ( ap @ ( ap @ xs @ sK7 ) @ sK6 )
!= ( ap @ xs @ ( ap @ sK7 @ sK6 ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f19,plain,
? [X0: lst,X1: lst] :
( ( ap @ ( ap @ xs @ X1 ) @ X0 )
!= ( ap @ xs @ ( ap @ X1 @ X0 ) ) ),
inference(rectify,[],[f11]) ).
thf(f11,plain,
? [X1: lst,X0: lst] :
( ( ap @ ( ap @ xs @ X0 ) @ X1 )
!= ( ap @ xs @ ( ap @ X0 @ X1 ) ) ),
inference(ennf_transformation,[],[f8]) ).
thf(f8,plain,
~ ! [X0: lst,X1: lst] :
( ( ap @ ( ap @ xs @ X0 ) @ X1 )
= ( ap @ xs @ ( ap @ X0 @ X1 ) ) ),
inference(rectify,[],[f5]) ).
thf(f5,negated_conjecture,
~ ! [X1: lst,X2: lst] :
( ( ap @ xs @ ( ap @ X1 @ X2 ) )
= ( ap @ ( ap @ xs @ X1 ) @ X2 ) ),
inference(negated_conjecture,[],[f4]) ).
thf(f4,conjecture,
! [X1: lst,X2: lst] :
( ( ap @ xs @ ( ap @ X1 @ X2 ) )
= ( ap @ ( ap @ xs @ X1 ) @ X2 ) ),
file('/export/starexec/sandbox/tmp/tmp.ZcYYrGgQyB/Vampire---4.8_12256',conj_0) ).
thf(f47,plain,
spl8_3,
inference(avatar_contradiction_clause,[],[f46]) ).
thf(f46,plain,
( $false
| spl8_3 ),
inference(trivial_inequality_removal,[],[f45]) ).
thf(f45,plain,
( ( ( ap @ sK5 @ sK4 )
!= ( ap @ sK5 @ sK4 ) )
| spl8_3 ),
inference(superposition,[],[f44,f23]) ).
thf(f23,plain,
! [X0: lst] :
( ( ap @ nl @ X0 )
= X0 ),
inference(cnf_transformation,[],[f10]) ).
thf(f10,plain,
! [X0: lst] :
( ( ap @ nl @ X0 )
= X0 ),
inference(rectify,[],[f3]) ).
thf(f3,axiom,
! [X7: lst] :
( ( ap @ nl @ X7 )
= X7 ),
file('/export/starexec/sandbox/tmp/tmp.ZcYYrGgQyB/Vampire---4.8_12256',fact_2p_Osimps_I1_J) ).
thf(f44,plain,
( ( ( ap @ nl @ ( ap @ sK5 @ sK4 ) )
!= ( ap @ sK5 @ sK4 ) )
| spl8_3 ),
inference(forward_demodulation,[],[f37,f23]) ).
thf(f37,plain,
( ( ( ap @ nl @ ( ap @ sK5 @ sK4 ) )
!= ( ap @ ( ap @ nl @ sK5 ) @ sK4 ) )
| spl8_3 ),
inference(avatar_component_clause,[],[f35]) ).
thf(f35,plain,
( spl8_3
<=> ( ( ap @ nl @ ( ap @ sK5 @ sK4 ) )
= ( ap @ ( ap @ nl @ sK5 ) @ sK4 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_3])]) ).
thf(f43,plain,
( spl8_1
| ~ spl8_3
| ~ spl8_4 ),
inference(avatar_split_clause,[],[f25,f40,f35,f29]) ).
thf(f25,plain,
! [X10: lst,X0: lst,X9: lst] :
( ( ( ap @ nl @ ( ap @ sK5 @ sK4 ) )
!= ( ap @ ( ap @ nl @ sK5 ) @ sK4 ) )
| ( ( ap @ ( cns @ sK1 @ sK0 ) @ ( ap @ sK3 @ sK2 ) )
!= ( ap @ ( ap @ ( cns @ sK1 @ sK0 ) @ sK3 ) @ sK2 ) )
| ( ( ap @ X0 @ ( ap @ X10 @ X9 ) )
= ( ap @ ( ap @ X0 @ X10 ) @ X9 ) ) ),
inference(cnf_transformation,[],[f18]) ).
thf(f18,plain,
! [X0: lst] :
( ( ( ( ap @ ( cns @ sK1 @ sK0 ) @ ( ap @ sK3 @ sK2 ) )
!= ( ap @ ( ap @ ( cns @ sK1 @ sK0 ) @ sK3 ) @ sK2 ) )
& ! [X5: lst,X6: lst] :
( ( ap @ sK0 @ ( ap @ X5 @ X6 ) )
= ( ap @ ( ap @ sK0 @ X5 ) @ X6 ) ) )
| ( ( ap @ nl @ ( ap @ sK5 @ sK4 ) )
!= ( ap @ ( ap @ nl @ sK5 ) @ sK4 ) )
| ! [X9: lst,X10: lst] :
( ( ap @ X0 @ ( ap @ X10 @ X9 ) )
= ( ap @ ( ap @ X0 @ X10 ) @ X9 ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5])],[f14,f17,f16,f15]) ).
thf(f15,plain,
( ? [X1: lst,X2: a] :
( ? [X3: lst,X4: lst] :
( ( ap @ ( cns @ X2 @ X1 ) @ ( ap @ X4 @ X3 ) )
!= ( ap @ ( ap @ ( cns @ X2 @ X1 ) @ X4 ) @ X3 ) )
& ! [X5: lst,X6: lst] :
( ( ap @ X1 @ ( ap @ X5 @ X6 ) )
= ( ap @ ( ap @ X1 @ X5 ) @ X6 ) ) )
=> ( ? [X4: lst,X3: lst] :
( ( ap @ ( cns @ sK1 @ sK0 ) @ ( ap @ X4 @ X3 ) )
!= ( ap @ ( ap @ ( cns @ sK1 @ sK0 ) @ X4 ) @ X3 ) )
& ! [X6: lst,X5: lst] :
( ( ap @ sK0 @ ( ap @ X5 @ X6 ) )
= ( ap @ ( ap @ sK0 @ X5 ) @ X6 ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f16,plain,
( ? [X4: lst,X3: lst] :
( ( ap @ ( cns @ sK1 @ sK0 ) @ ( ap @ X4 @ X3 ) )
!= ( ap @ ( ap @ ( cns @ sK1 @ sK0 ) @ X4 ) @ X3 ) )
=> ( ( ap @ ( cns @ sK1 @ sK0 ) @ ( ap @ sK3 @ sK2 ) )
!= ( ap @ ( ap @ ( cns @ sK1 @ sK0 ) @ sK3 ) @ sK2 ) ) ),
introduced(choice_axiom,[]) ).
thf(f17,plain,
( ? [X7: lst,X8: lst] :
( ( ap @ ( ap @ nl @ X8 ) @ X7 )
!= ( ap @ nl @ ( ap @ X8 @ X7 ) ) )
=> ( ( ap @ nl @ ( ap @ sK5 @ sK4 ) )
!= ( ap @ ( ap @ nl @ sK5 ) @ sK4 ) ) ),
introduced(choice_axiom,[]) ).
thf(f14,plain,
! [X0: lst] :
( ? [X1: lst,X2: a] :
( ? [X3: lst,X4: lst] :
( ( ap @ ( cns @ X2 @ X1 ) @ ( ap @ X4 @ X3 ) )
!= ( ap @ ( ap @ ( cns @ X2 @ X1 ) @ X4 ) @ X3 ) )
& ! [X5: lst,X6: lst] :
( ( ap @ X1 @ ( ap @ X5 @ X6 ) )
= ( ap @ ( ap @ X1 @ X5 ) @ X6 ) ) )
| ? [X7: lst,X8: lst] :
( ( ap @ ( ap @ nl @ X8 ) @ X7 )
!= ( ap @ nl @ ( ap @ X8 @ X7 ) ) )
| ! [X9: lst,X10: lst] :
( ( ap @ X0 @ ( ap @ X10 @ X9 ) )
= ( ap @ ( ap @ X0 @ X10 ) @ X9 ) ) ),
inference(rectify,[],[f13]) ).
thf(f13,plain,
! [X0: lst] :
( ? [X4: lst,X3: a] :
( ? [X8: lst,X7: lst] :
( ( ap @ ( ap @ ( cns @ X3 @ X4 ) @ X7 ) @ X8 )
!= ( ap @ ( cns @ X3 @ X4 ) @ ( ap @ X7 @ X8 ) ) )
& ! [X5: lst,X6: lst] :
( ( ap @ X4 @ ( ap @ X5 @ X6 ) )
= ( ap @ ( ap @ X4 @ X5 ) @ X6 ) ) )
| ? [X2: lst,X1: lst] :
( ( ap @ nl @ ( ap @ X1 @ X2 ) )
!= ( ap @ ( ap @ nl @ X1 ) @ X2 ) )
| ! [X9: lst,X10: lst] :
( ( ap @ X0 @ ( ap @ X10 @ X9 ) )
= ( ap @ ( ap @ X0 @ X10 ) @ X9 ) ) ),
inference(flattening,[],[f12]) ).
thf(f12,plain,
! [X0: lst] :
( ! [X9: lst,X10: lst] :
( ( ap @ X0 @ ( ap @ X10 @ X9 ) )
= ( ap @ ( ap @ X0 @ X10 ) @ X9 ) )
| ? [X4: lst,X3: a] :
( ? [X8: lst,X7: lst] :
( ( ap @ ( ap @ ( cns @ X3 @ X4 ) @ X7 ) @ X8 )
!= ( ap @ ( cns @ X3 @ X4 ) @ ( ap @ X7 @ X8 ) ) )
& ! [X5: lst,X6: lst] :
( ( ap @ X4 @ ( ap @ X5 @ X6 ) )
= ( ap @ ( ap @ X4 @ X5 ) @ X6 ) ) )
| ? [X2: lst,X1: lst] :
( ( ap @ nl @ ( ap @ X1 @ X2 ) )
!= ( ap @ ( ap @ nl @ X1 ) @ X2 ) ) ),
inference(ennf_transformation,[],[f7]) ).
thf(f7,plain,
! [X0: lst] :
( ! [X1: lst,X2: lst] :
( ( ap @ nl @ ( ap @ X1 @ X2 ) )
= ( ap @ ( ap @ nl @ X1 ) @ X2 ) )
=> ( ! [X4: lst,X3: a] :
( ! [X5: lst,X6: lst] :
( ( ap @ X4 @ ( ap @ X5 @ X6 ) )
= ( ap @ ( ap @ X4 @ X5 ) @ X6 ) )
=> ! [X7: lst,X8: lst] :
( ( ap @ ( ap @ ( cns @ X3 @ X4 ) @ X7 ) @ X8 )
= ( ap @ ( cns @ X3 @ X4 ) @ ( ap @ X7 @ X8 ) ) ) )
=> ! [X9: lst,X10: lst] :
( ( ap @ X0 @ ( ap @ X10 @ X9 ) )
= ( ap @ ( ap @ X0 @ X10 ) @ X9 ) ) ) ),
inference(rectify,[],[f1]) ).
thf(f1,axiom,
! [X0: lst] :
( ! [X1: lst,X2: lst] :
( ( ap @ nl @ ( ap @ X1 @ X2 ) )
= ( ap @ ( ap @ nl @ X1 ) @ X2 ) )
=> ( ! [X3: a,X4: lst] :
( ! [X5: lst,X6: lst] :
( ( ap @ X4 @ ( ap @ X5 @ X6 ) )
= ( ap @ ( ap @ X4 @ X5 ) @ X6 ) )
=> ! [X1: lst,X2: lst] :
( ( ap @ ( cns @ X3 @ X4 ) @ ( ap @ X1 @ X2 ) )
= ( ap @ ( ap @ ( cns @ X3 @ X4 ) @ X1 ) @ X2 ) ) )
=> ! [X6: lst,X5: lst] :
( ( ap @ X0 @ ( ap @ X5 @ X6 ) )
= ( ap @ ( ap @ X0 @ X5 ) @ X6 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.ZcYYrGgQyB/Vampire---4.8_12256',fact_0_lst_Oinduct_091where_AP_A_061_A_C_Fxs_O_AALL_Ays_Azs_O_Aap_Axs_A_Iap_Ays_Azs_J_A_061_Aap_A_Iap_Axs_Ays_J_Azs_C_093) ).
thf(f38,plain,
( spl8_1
| spl8_2
| ~ spl8_3 ),
inference(avatar_split_clause,[],[f24,f35,f32,f29]) ).
thf(f24,plain,
! [X10: lst,X0: lst,X6: lst,X9: lst,X5: lst] :
( ( ( ap @ X0 @ ( ap @ X10 @ X9 ) )
= ( ap @ ( ap @ X0 @ X10 ) @ X9 ) )
| ( ( ap @ nl @ ( ap @ sK5 @ sK4 ) )
!= ( ap @ ( ap @ nl @ sK5 ) @ sK4 ) )
| ( ( ap @ sK0 @ ( ap @ X5 @ X6 ) )
= ( ap @ ( ap @ sK0 @ X5 ) @ X6 ) ) ),
inference(cnf_transformation,[],[f18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : DAT056^1 : TPTP v8.1.2. Released v5.4.0.
% 0.10/0.12 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.11/0.33 % Computer : n012.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Fri May 3 12:53:25 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.11/0.33 This is a TH0_THM_EQU_NAR problem
% 0.11/0.33 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.ZcYYrGgQyB/Vampire---4.8_12256
% 0.11/0.35 % (12368)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on Vampire---4 for (2999ds/2Mi)
% 0.11/0.35 % (12367)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on Vampire---4 for (2999ds/2Mi)
% 0.11/0.35 % (12366)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on Vampire---4 for (2999ds/27Mi)
% 0.11/0.35 % (12365)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on Vampire---4 for (2999ds/4Mi)
% 0.11/0.35 % (12369)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on Vampire---4 for (2999ds/275Mi)
% 0.11/0.35 % (12370)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on Vampire---4 for (2999ds/18Mi)
% 0.11/0.35 % (12371)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on Vampire---4 for (2999ds/3Mi)
% 0.11/0.35 % (12367)Instruction limit reached!
% 0.11/0.35 % (12367)------------------------------
% 0.11/0.35 % (12367)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.11/0.35 % (12367)Termination reason: Unknown
% 0.11/0.35 % (12367)Termination phase: Saturation
% 0.11/0.35 % (12368)Instruction limit reached!
% 0.11/0.35 % (12368)------------------------------
% 0.11/0.35 % (12368)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.11/0.35 % (12368)Termination reason: Unknown
% 0.11/0.35 % (12368)Termination phase: Property scanning
% 0.11/0.35
% 0.11/0.35 % (12369)Refutation not found, incomplete strategy
% 0.11/0.35 % (12369)------------------------------
% 0.11/0.35 % (12369)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.11/0.35 % (12368)Memory used [KB]: 895
% 0.11/0.35 % (12369)Termination reason: Refutation not found, incomplete strategy
% 0.11/0.35
% 0.11/0.35 % (12368)Time elapsed: 0.003 s
% 0.11/0.35
% 0.11/0.35 % (12368)Instructions burned: 3 (million)
% 0.11/0.35 % (12369)Memory used [KB]: 5373
% 0.11/0.35 % (12368)------------------------------
% 0.11/0.35 % (12368)------------------------------
% 0.11/0.35 % (12369)Time elapsed: 0.002 s
% 0.11/0.35 % (12369)Instructions burned: 1 (million)
% 0.11/0.35 % (12369)------------------------------
% 0.11/0.35 % (12369)------------------------------
% 0.11/0.35
% 0.11/0.35 % (12367)Memory used [KB]: 5500
% 0.11/0.35 % (12367)Time elapsed: 0.003 s
% 0.11/0.35 % (12367)Instructions burned: 2 (million)
% 0.11/0.35 % (12367)------------------------------
% 0.11/0.35 % (12367)------------------------------
% 0.11/0.35 % (12371)Instruction limit reached!
% 0.11/0.35 % (12371)------------------------------
% 0.11/0.35 % (12371)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.11/0.35 % (12371)Termination reason: Unknown
% 0.11/0.35 % (12371)Termination phase: Saturation
% 0.11/0.35
% 0.11/0.35 % (12371)Memory used [KB]: 1023
% 0.11/0.35 % (12371)Time elapsed: 0.003 s
% 0.11/0.35 % (12371)Instructions burned: 3 (million)
% 0.11/0.35 % (12371)------------------------------
% 0.11/0.35 % (12371)------------------------------
% 0.11/0.35 % (12365)Instruction limit reached!
% 0.11/0.35 % (12365)------------------------------
% 0.11/0.35 % (12365)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.11/0.35 % (12365)Termination reason: Unknown
% 0.11/0.35 % (12364)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on Vampire---4 for (2999ds/183Mi)
% 0.11/0.35 % (12365)Termination phase: Saturation
% 0.11/0.35
% 0.11/0.35 % (12365)Memory used [KB]: 5500
% 0.11/0.35 % (12365)Time elapsed: 0.003 s
% 0.11/0.35 % (12365)Instructions burned: 4 (million)
% 0.11/0.35 % (12365)------------------------------
% 0.11/0.35 % (12365)------------------------------
% 0.11/0.35 % (12366)First to succeed.
% 0.11/0.36 % (12370)Also succeeded, but the first one will report.
% 0.11/0.36 % (12366)Refutation found. Thanks to Tanya!
% 0.11/0.36 % SZS status Theorem for Vampire---4
% 0.11/0.36 % SZS output start Proof for Vampire---4
% See solution above
% 0.11/0.36 % (12366)------------------------------
% 0.11/0.36 % (12366)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.11/0.36 % (12366)Termination reason: Refutation
% 0.11/0.36
% 0.11/0.36 % (12366)Memory used [KB]: 5500
% 0.11/0.36 % (12366)Time elapsed: 0.007 s
% 0.11/0.36 % (12366)Instructions burned: 5 (million)
% 0.11/0.36 % (12366)------------------------------
% 0.11/0.36 % (12366)------------------------------
% 0.11/0.36 % (12363)Success in time 0.019 s
% 0.11/0.36 % Vampire---4.8 exiting
%------------------------------------------------------------------------------